Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs
نویسندگان
چکیده
منابع مشابه
Experimental Comparison of Graph Drawing Algorithms for Cubic Graphs
We report on the results of an experimental study in which we have compared the performances of three algorithms for drawing general cubic graphs on the bidimensional orthogonal grid. The comparison works on 18,000 randomly generated graphs with up to 300 vertices and analyzes the number of bends and crossings, the area, the edge length and the running time. Communicated by R. Tamassia: submitt...
متن کاملAn Experimental Comparison of Four Graph Drawing Algorithms
In this paper we present an extensive experimental study comparing four general-purpose graph drawing algorithms. The four algorithms take as input general graphs (with no restrictions whatsoever on connectivity, planarity, etc.) and construct orthogonal grid drawings, which are widely used in software and database visualization applications. The test data (available by anonymous ftp) are 11,58...
متن کاملExperimental studies on graph drawing algorithms
1Center for Geometric Computing, Department of Computer Science, Brown University, 115 Waterman Street, Providence, RI 02912-1910, U.S.A. 2Dipartimento di Informatica e Automazione, Università degli Studi di Roma Tre, Via della Vasca Navale 79, 00146 Roma, Italy 3Department of Computer Science and Engineering, State University of New York at Buffalo, 226 Bell Hall, Buffalo, NY 14260-2000, U.S.A...
متن کاملGraph Drawing: Algorithms for the Visualization of Graphs
What do you do to start reading graph drawing algorithms for the visualization of graphs? Searching the book that you love to read first or find an interesting book that will make you want to read? Everybody has difference with their reason of reading a book. Actuary, reading habit must be from earlier. Many people may be love to read, but not a book. It's not fault. Someone will be bored to op...
متن کاملAn Experimental Comparison of Fast Algorithms for Drawing General Large Graphs
Abstract. In the last decade several algorithms that generate straightline drawings of general large graphs have been invented. In this paper we investigate some of these methods that are based on force-directed or algebraic approaches in terms of running time and drawing quality on a big variety of artificial and real-world graphs. Our experiments indicate that there exist significant differen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 1999
ISSN: 1526-1719
DOI: 10.7155/jgaa.00013